Composite lifting of group inequalities and an application to two-row mixing inequalities
نویسندگان
چکیده
Given a valid inequality for the mixed integer infinite group relaxation, a composite lifting approach that combines sequential lifting and use of a fill-in function is proposed that can be used to strengthen this inequality. Properties of this composite lifting such as bounds on the solution of the lifting problem and some necessary conditions for the lifted inequality to be minimal for the mixed integer infinite group relaxation are presented. Finally, this composite lifting approach is used to generate a strengthened version of the two-row mixing inequality that provides a new class of extreme inequalities for the two-row mixed integer infinite group relaxation.
منابع مشابه
Lifting Group Inequalities and an Application to Mixing Inequalities∗
Given a valid inequality for the mixed integer infinite group relaxation, a lifting based approach is presented that can be used to strengthen this inequality. Bounds on the solution of the corresponding lifting problem and some necessary conditions for the lifted inequality to be minimal for the mixed integer infinite group relaxation are presented. Finally, these results are applied to genera...
متن کاملStrong Inequalities for Chance–Constrained Programming
As an essential substructure underlying a large class of chance-constrained programming problems with finite discrete distributions, the mixing set with 0 − 1 knapsack has received considerable attentions in recent literature. In this study, we present a family of strong inequalities that subsume known inequalities for this set. We also find many other inequalities that can be explained by lift...
متن کاملTwo row mixed-integer cuts via lifting
Recently Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [10] have characterized the extreme valid inequalities of a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these inequ...
متن کاملIntersection Cuts for Single Row Corner Relaxations
We consider the problem of generating inequalities that are valid for one-row relaxations of a simplex tableau, with the integrality constraints preserved for one or more non-basic variables. These relaxations are interesting because they can be used to generate cutting planes for general mixed-integer problems. We first consider the case of a single nonbasic integer variable. This relaxation i...
متن کاملMixed n-step MIR inequalities: Facets for the n-mixing set
Günlük and Pochet [O. Günlük , Y. Pochet: Mixing mixed integer inequalities. Mathematical Programming 90(2001) 429-457] proposed a procedure to mix mixed integer rounding (MIR) inequalities. The mixed MIR inequalities define the convex hull of the mixing set {(y, . . . , y, v) ∈ Z × R+ : α1y + v ≥ βi, i = 1, . . . ,m} and can also be used to generate valid inequalities for general as well as se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Optimization
دوره 7 شماره
صفحات -
تاریخ انتشار 2010